package com.hot100;

public class Solution153 {
    public int findMin(int[] nums) {
        int i = 0;
        int j = nums.length;
        while (i < j) {
            int mid = (i + j) >> 1;
            if (nums[mid] > nums[nums.length - 1]) i = mid + 1;
            else j = mid;
        }
        return nums[i];
    }
}
